Algorithms for Propositional Model Enumeration and Counting

A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and hybrid solvers. Besides practical applications, the problem of counting propositional models is of key relevancy in computational complexity. In recent years a number of algorithms have been proposed for propositional model counting and enumeration. However, the algorithms for model counting and model enumeration have been developed in different contexts, and so are based on fairly different techniques. This paper surveys algorithms for both model enumeration and model counting, proposes optimizations to model enumeration algorithms, and addresses open topics in model counting. Experimental results, obtained on practical and representative problem instances, indicate that the proposed techniques are effective for model enumeration.